A strongly polynomial algorithm for line search in submodular polyhedra
نویسندگان
چکیده
منابع مشابه
A strongly polynomial algorithm for line search in submodular polyhedra
A submodular polyhedron is a polyhedron associated with a submodular function. This paper presents a strongly polynomial time algorithm for line search in submodular polyhedra with the aid of a fully combinatorial algorithm for submodular function minimization. The algorithm is based on the parametric search method proposed by Megiddo.
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS A Strongly Polynomial Algorithm for Line Search in Submodular Polyhedra
A submodular polyhedron is a polyhedron associated with a submodular function. This paper presents a strongly polynomial time algorithm for line search in submodular polyhedra with the aid of a fully combinatorial algorithm for submodular function minimization as a subroutine. The algorithm is based on the parametric search method proposed by Megiddo.
متن کاملA Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
We consider the problem of minimizing a submodular function f defined on a set V with n elements. We give a combinatorial algorithm that runs in O(n EO + n) time, where EO is the time to evaluate f(S) for some S ⊆ V. This improves the previous best strongly polynomial running time by more than a factor of n
متن کاملA Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear programming method. No bound on the complexity of the values of f is needed to be known a priori. The number of oracle calls is bounded by a polynomial in the size of the underlying set.
متن کاملA Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow
This paper presents a new strongly polynomial cut canceling algorithm for minimum cost submodular flow. The algorithm is a generalization of our similar cut canceling algorithm for ordinary min-cost flow. The algorithm scales a relaxed optimality parameter, and creates a second, inner relaxation that is a kind of submodular max flow problem. The outer relaxation uses a novel technique for relax...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2007
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2007.09.002